A Curvilinear Search Method for p-Harmonic Flows on Spheres
نویسندگان
چکیده
منابع مشابه
A Curvilinear Search Method for p-Harmonic Flows on Spheres
The problem of finding p-harmonic flows arises in a wide range of applications including color image (chromaticity) denoising, micromagnetics, liquid crystal theory, and directional diffusion. In this paper, we propose an innovative curvilinear search method for minimizing p-harmonic energies over spheres. Starting from a flow (map) on the unit sphere, our method searches along a curve that lie...
متن کاملA Convergent and Constraint-Preserving Finite Element Method for the p-Harmonic Flow into Spheres
An explicit fully discrete finite element method, which satisfies the nonconvex side constraint at every node, is developed for approximating the p-harmonic flow for p ∈ (1,∞). Convergence of the method is established under certain conditions on the domain and mesh. Computational examples are presented to demonstrate finite-time blow-ups and qualitative geometric changes of weak solutions of th...
متن کاملLattice Boltzmann method for 2D flows in curvilinear coordinates
In order to improve efficiency and accuracy, while maintaining an ease of modeling flows with the lattice Boltzmann approach in domains having complex geometry, a method for modeling equations of 2D flow in curvilinear coordinates has been developed. Both the transformed shallow water equations and the transformed 2D Navier-Stokes equations in the horizontal plane were synchronized with the equ...
متن کاملHarmonic analysis on spheres
1. Calculus on spheres 2. Spherical Laplacian from Euclidean 3. Eigenvectors for the spherical Laplacian 4. Invariant integrals on spheres 5. L spectral decompositions on spheres 6. Sup-norms of spherical harmonics on Sn−1 7. Pointwise convergence of Fourier-Laplace series 8. Irreducibility of representation spaces for O(n) 9. Hecke’s identity • Appendix: Bernstein’s proof of Weierstraß approxi...
متن کاملA novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Imaging Sciences
سال: 2009
ISSN: 1936-4954
DOI: 10.1137/080726926